Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
نویسندگان
چکیده
منابع مشابه
Bounded Model Checking and Induction: From Refutation to Verification
We explore the combination of bounded model checking and induction for proving safety properties of infinite-state systems. In particular, we define a general k-induction scheme and prove completeness thereof. A main characteristic of our methodology is that strengthened invariants are generated from failed k-induction proofs. This strengthening step requires quantifier-elimination, and we prop...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملLazy Approximation for Dense Real-Time Systems
ing TCTL Formulas Abstraction predicates are extracted from the timed-bounded modalities of the TCTL formula A new clock variable zi is introduced for every time-bounded operator Example: φ = EG<2 p ∧ A[qU≤4 r] Set of predicates: Ψφ = {z1 < 2 } {{ } ψ1 , z2 ≤ 4 } {{ } ψ2 } Abstract CTL formula: φ̂ = EG(p∧ψ1) ∧ A[qU (r∧ψ2)] Lazy Approximation – p.6 Soundness and Completeness Basis predicates: Set...
متن کاملConstructing Correct Circuits: Verification of Functional Aspects of Hardware Specifications with Dependent Types
This paper focuses on the important, but tricky, problem of determining provably correct program properties automatically from program source. We describe a novel approach to constructing correct low-level programs. By using modern, full-spectrum dependent types, we are able to give an explicit and checkable link between the low-level program and its high-level meaning. Our approach closely lin...
متن کاملFlaw Detection in Formal Specifications
In verification of finite domain models (model checking) counterexamples help the user to identify, why a proof attempt has failed. In this paper we present an approach to construct counterexamples for first-order goals over infinite data types, which are defined by algebraic specifications. The approach avoids the implementation of a new calculus, by integrating counterexample search with the ...
متن کامل